A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems

This paper is concerned with a new approach to preconditioning for large sparse linear systems A procedure for computing an incomplete factorization of the inverse of a nonsymmetric matrix is developed and the resulting factorized sparse approximate inverse is used as an explicit preconditioner for conjugate gradient type methods Some theoretical properties of the preconditioner are discussed a...

متن کامل

A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems

Motivated by the paper [16], where the authors proposed a method to solve a symmetric positive definite (SPD) system Ax = b via a sparse-sparse iterative-based projection method, we extend this method to nonsymmetric linear systems and propose a modified method to construct a sparse approximate inverse preconditioner by using the Frobenius norm minimization technique in this paper. Numerical ex...

متن کامل

A Sparse Approximate Inverse Preconditioner for Nonsymmetric Positive Definite Matrices

We develop an algorithm for computing a sparse approximate inverse for a nonsymmetric positive definite matrix based upon the FFAPINV algorithm. The sparse approximate inverse is computed in the factored form and used to work with some Krylov subspace methods. The preconditioner is breakdown free and, when used in conjunction with Krylovsubspace-based iterative solvers such as the GMRES algorit...

متن کامل

Block Approximate Inverse Preconditioners for Sparse Nonsymmetric Linear Systems

Abstract. In this paper block approximate inverse preconditioners to solve sparse nonsymmetric linear systems with iterative Krylov subspace methods are studied. The computation of the preconditioners involves consecutive updates of variable rank of an initial and nonsingular matrix A0 and the application of the Sherman-MorrisonWoodbury formula to compute an approximate inverse decomposition of...

متن کامل

A Block Approximate Inverse With Cutoff Preconditioner For Semi-Sparse Linear Systems

Ikuro Yamazaki Graduate School of Systems and Information Engineering, University of Tsukuba, Japan [email protected] Masayuki Okada Department of Middleware & Platform Software, Hitachi, Ltd., Japan [email protected] Hiroto Tadano, Tetsuya Sakurai Department of Computer Science, University of Tsukuba, Japan [email protected], [email protected] Keita Teranishi ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Scientific Computing

سال: 1998

ISSN: 1064-8275,1095-7197

DOI: 10.1137/s1064827595294691